Distributed Data Clustering Using Expectation Maximization Algorithm
نویسندگان
چکیده
منابع مشابه
Chemical Reaction Algorithm for Expectation Maximization Clustering
Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, re...
متن کاملSimilarity based clustering using the expectation maximization algorithm
In this paper we present a new approach for clustering data. The clustering metric used is the normalized crosscorrelation, also known as similarity, instead of the traditionally used Euclidean distance. The main advantage of this metric is that it depends on the signal shape rather than its amplitude. Under an assumption of an exponential probability model that has several desirable properties...
متن کاملDynamic Data Rectification Using the Expectation Maximization Algorithm
Although on-line measurements play a ®ital role in process control and monitoring ( process performance, they are corrupted by noise and occasional outliers such as noise ) spikes . Thus, there is a need to rectify the data by remo®ing outliers and reducing noise effects. Well-known techniques such as Kalman Filtering ha®e been used effecti®ely to filter noise measurements, but it is not design...
متن کاملA Hybrid Approach for Data Clustering using Expectation- Maximization and Parameter Adaptive Harmony Search Algorithm
This paper presents a novel hybrid data clustering algorithm based on parameter adaptive harmony search algorithm. The recently developed parameter adaptive harmony search algorithm (PAHS) is used to refine the cluster centers, which are further used in initializing Expectation-Maximization clustering algorithm. The optimal number of clusters are determined through four well-known cluster valid...
متن کاملExpectation Maximization Deconvolution Algorithm
In this paper, we use a general mathematical and experimental methodology to analyze image deconvolution. The main procedure is to use an example image convolving it with a know Gaussian point spread function and then develop algorithms to recover the image. Observe the deconvolution process by adding Gaussian and Poisson noise at different signal to noise ratios. In addition, we will describe ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2009
ISSN: 1812-5654
DOI: 10.3923/jas.2009.854.864